Large Cross‐Free Sets in Steiner Triple Systems

A cross‐free set of size m in a Steiner triple system is three pairwise disjoint m‐element subsets such that no intersects all the three ‐s. We conjecture that for every admissible n there is an STS(n) with a cross‐free set of size which if true, is best possible. We prove this conjecture for the case , constructing an STS containing a cross‐free set of size 6k. We note that some of the 3‐bichromatic STSs, constructed by Colbourn, Dinitz, and Rosa, have cross‐free sets of size close to 6k (but cannot have size exactly 6k). The constructed STS shows that equality is possible for in the following result: in every 3‐coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic connected component of size at least (we conjecture that equality holds for every admissible n). The analog problem can be asked for r‐colorings as well, if and is a prime power, we show that the answer is the same as in case of complete graphs: in every r‐coloring of the blocks of any STS(n), there is a monochromatic connected component with at least points, and this is sharp for infinitely many n.     

D-完全一致混合超图不可着色的一个充要条件

混合超图的上,下色数与C-超边和D-超边数有着必然联系.一般地,增加C边会使下色数x(H)增加,增加D-超边会使上色数(x)(H)减小.本论文对D-完全一致混合超图进行研究,利用组合数学中分划思想及方法得到的D-完全一致混合超图不可着色的一个充要条件,对D-完全一致混合超图能否着色找到了可行的依据,进一步揭示C-超边数...     

On non-strong jumping numbers and density structures of hypergraphs

Estimating Turán densities of hypergraphs is believed to be one of the most challenging problems in extremal set theory. The concept of ‘jump’ concerns the distribution of Turán densities. A number α∈[0,1) is a jump for r-uniform graphs if there exists a constant c>0 such that for any family F of r-uniform graphs, if the Turán density of F is greater than α, then the Turán density of F is at least α+c. A fundamental result in extremal graph theory due to Erd?s and Stone implies that every number in [0,1) is a jump for graphs. Erd?s also showed that every number in [0,r!/r^r) is a jump for r-uniform hypergraphs. Furthermore, Frankl and Rödl showed the existence of non-jumps for hypergraphs. Recently, more non-jumps were found in [r!/r^r,1) for r-uniform hypergraphs. But there are still a lot of unknowns regarding jumps for hypergraphs. In this paper, we propose a new but related concept-strong-jump and describe several sequences of non-strong-jumps. It might help us to understand the distribution of Turán densities for hypergraphs better by finding more non-strong-jumps.     

对谱半径至多为$\sqrt[r]{2+\sqrt{5}}$的超图的分类研究

在本文,我们研究谱半径至多为$\sqrt[r]{2+\sqrt{5}}$的超图.我们得到此种超图必须具有一个基普结构,这与Woo-Neumaier在2007年对谱半径至多为$\frac{3}{2}\sqrt{2}$的图的分类结果类似.     

On Graph-Lagrangians and clique numbers of 3-uniform hypergraphs

The paper explores the connection of Graph-Lagrangians and its maximum cliques for 3-uniform hypergraphs.Motzkin and Straus showed that the Graph-Lagrangian of a graph is the Graph-Lagrangian of its maximum cliques.This connection provided a new proof of Turán classical result on the Turán density of complete graphs.Since then,Graph-Lagrangian has become a useful tool in extremal problems for hypergraphs.Peng and Zhao attempted to explore the relationship between the Graph-Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range.They showed that if G is a 3-uniform graph with m edges containing a clique of order t-1,then λ(G)=λ([t-1]~((3))) provided (t-13)≤m≤(t-13)+_(t-22).They also conjectured:If G is an r-uniform graph with m edges not containing a clique of order t-1,then λ(G)λ([t-1]~((r))) provided (t-1r)≤ m ≤(t-1r)+(t-2r-1).It has been shown that to verify this conjecture for 3-uniform graphs,it is sufficient to verify the conjecture for left-compressed 3-uniform graphs with m=t-13+t-22.Regarding this conjecture,we show: If G is a left-compressed 3-uniform graph on the vertex set [t] with m edges and |[t-1]~((3))\E(G)|=p,then λ(G)λ([t-1]~((3))) provided m=(t-13)+(t-22) and t≥17p/2+11.     

Isomorphic edge disjoint subgraphs of hypergraphs

We show that any k‐uniform hypergraph with n edges contains two isomorphic edge disjoint subgraphs of size for k = 4, 5 and 6. This is best possible up to a logarithmic factor due to an upper bound construction of Erd?s, Pach, and Pyber who show there exist k‐uniform hypergraphs with n edges and with no two edge disjoint isomorphic subgraphs with size larger than . Furthermore, our result extends results Erd?s, Pach and Pyber who also established the lower bound for k = 2 (eg. for graphs), and of Gould and Rödl who established the result for k = 3. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 48, 767–793, 2016     

A sufficient condition for the bicolorability of a hypergraph

In this note we prove a long-standing conjecture of Sterboul [P. Duchet, Hypergraphs, in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, 1995, pp. 381-432 (Chapter 7)], which states that a hypergraph is bicolorable provided it does not contain a specific kind of odd cycle. This is currently the strongest result of its kind, improving on results by Berge [Graphs and Hypergraphs, North-Holland, American Elsevier, Amsterdam, 1973] and Fournier and Las Vergnas [Une classe d’hypergraphes bichromatiques II, Discrete Math. 7 (1974) 99-106; A class of bichromatic hypergraphs, Ann. Discrete Math. 21, in: C. Berge, V. Chvátal (Eds.), Topics on Perfect Graphs, 1984, pp. 21-27].